Systems and methods for controlling communications based on machine learned information

ABSTRACT

Systems and methods for operating a communication device. The methods comprise: receiving a signal at the communication device; performing, by the communication device, one or more machine learning algorithms using at least one feature of the signal as an input to generate a plurality of scores (each score representing a likelihood that the signal was modulated using a given modulation type of a plurality of different modulation types); assigning a modulation class to the signal based on the plurality of scores; determining whether a given wireless channel is available based at least on the modulation class assigned to the signal; and selectively using the given wireless channel for communicating signals based on results of the determining.

BACKGROUND Statement of the Technical Field

The present disclosure relates generally to communication systems. Moreparticularly, the present disclosure relates to implementing systems andmethods for controlling communications based on machine learnedinformation.

Description of the Related Art

Wireless communication systems exist today, and are used in variousapplications. Some of these wireless communication systems comprisecognitive radios. A cognitive radio is a radio that is configured todynamically use wireless channels to avoid user interference andcongestion. During operations, the cognitive radio detects which of thewireless channels is(are) available, and then configures its parametersto facilitate use of the available communication channel(s).

SUMMARY

The present disclosure concerns implementing systems and methods foroperating a communication device (e.g., a cognitive radio). The methodscomprise: receiving a signal at the communication device; performing, bythe communication device, one or more machine learning algorithms usingat least one feature of the signal as an input to generate a pluralityof scores (each score representing a likelihood that the signal wasmodulated using a given modulation type of a plurality of differentmodulation types); assigning a modulation class to the signal based onthe plurality of scores; determining whether a given wireless channel isavailable based at least on the modulation class assigned to the signal;and selectively using the given wireless channel for communicatingsignals based on results of the determining.

In some scenarios, the signal is assigned the modulation class that isassociated with a given score selected from the plurality of scores. Thescore may be selected as the score with the greatest or highest value.Alternatively, the score is selected based on results from performanceof an optimization algorithm (e.g., a game theory analysis of themachine learning algorithms and outputs). The scores can include, butare not limited to, goodness-of-fit-predicted scores.

In those or other scenarios, the methods further involve decidingwhether a source of the signal was a primary user of the given wirelesschannel based on the modulation class assigned to the signal, a bit rateof the signal, and/or a center frequency of the signal. A determinationis made that the given wireless channel is unavailable when a decisionis made that the primary user is the source of the signal.

The implementing systems comprise a processor, and a non-transitorycomputer-readable storage medium comprising programming instructionsthat are configured to cause the processor to implement a method forperforming demodulation operations to extract the desired signal fromthe combined waveform.

BRIEF DESCRIPTION OF THE DRAWINGS

The present solution will be described with reference to the followingdrawing figures, in which like numerals represent like items throughoutthe figures.

FIG. 1 provides an illustration of an illustrative signal classificationsystem.

FIG. 2 provides an illustration of an illustrative system configured toperform signal recognition and classification in accordance with thepresent solution.

FIG. 3 provides a flow diagram of an illustrative method for operatingthe system of FIG. 1.

FIG. 4 provides a block diagram of an illustrative communication device.

FIG. 5 provides a table showing illustrative machine learn relatedinformation.

FIG. 6 provides a block diagram of an illustrative cognitive sensor.

FIG. 7 provides graphs that are useful for understanding operations ofthe cognitive sensor shown in FIG. 6.

FIGS. 8-10 provide illustrations of illustrative machine learningalgorithm architectures.

FIG. 11 provides a table that is useful for understanding game theory.

FIG. 12 provides a graph that is useful for understanding game theory.

FIG. 13 provides a flow diagram of an illustrative method fordetermining an availability of channel(s) in a wireless spectrum.

DETAILED DESCRIPTION

It will be readily understood that the components of the embodiments asgenerally described herein and illustrated in the appended figures couldbe arranged and designed in a wide variety of different configurations.Thus, the following more detailed description of various embodiments, asrepresented in the figures, is not intended to limit the scope of thepresent disclosure, but is merely representative of various embodiments.While the various aspects of the embodiments are presented in drawings,the drawings are not necessarily drawn to scale unless specificallyindicated.

The present solution may be embodied in other specific forms withoutdeparting from its spirit or essential characteristics. The describedembodiments are to be considered in all respects only as illustrativeand not restrictive. The scope of the present solution is, therefore,indicated by the appended claims rather than by this detaileddescription. All changes which come within the meaning and range ofequivalency of the claims are to be embraced within their scope.

Reference throughout this specification to features, advantages, orsimilar language does not imply that all of the features and advantagesthat may be realized with the present solution should be or are in anysingle embodiment of the present solution. Rather, language referring tothe features and advantages is understood to mean that a specificfeature, advantage, or characteristic described in connection with anembodiment is included in at least one embodiment of the presentsolution. Thus, discussions of the features and advantages, and similarlanguage, throughout the specification may, but do not necessarily,refer to the same embodiment.

Furthermore, the described features, advantages and characteristics ofthe present solution may be combined in any suitable manner in one ormore embodiments. One skilled in the relevant art will recognize, inlight of the description herein, that the present solution can bepracticed without one or more of the specific features or advantages ofa particular embodiment. In other instances, additional features andadvantages may be recognized in certain embodiments that may not bepresent in all embodiments of the present solution.

Reference throughout this specification to “one embodiment”, “anembodiment”, or similar language means that a particular feature,structure, or characteristic described in connection with the indicatedembodiment is included in at least one embodiment of the presentsolution. Thus, the phrases “in one embodiment”, “in an embodiment”, andsimilar language throughout this specification may, but do notnecessarily, all refer to the same embodiment.

As used in this document, the singular form “a”, “an”, and “the” includeplural references unless the context clearly dictates otherwise. Unlessdefined otherwise, all technical and scientific terms used herein havethe same meanings as commonly understood by one of ordinary skill in theart. As used in this document, the term “comprising” means “including,but not limited to”.

Signal recognition and classification has been accomplished usingfeature-based, expert-system-driven (i.e., non-machine-learning)techniques. The feature-based, expert-system-driven techniques arerelatively computationally slow and costly to implement. The presentsolution provides an alternative solution for signal recognition andclassification that overcomes the drawbacks of conventionalfeature-based, expert-system-driven solutions.

The present solution employs a machine-learning based approach whichprovides a faster, less-expensive path to adding new signals to a listof recognized signals, offers better recognition performance at lowerSignal-to-Noise Ratios (SNRs), and recognizes signals and sourcesthereof faster and with an improved accuracy as compared to that of theconventional feature-based, expert-system-driven solutions. In somescenarios, the machine-learning based approach uses expert systemsand/or deep learning to facilitate signal recognition andclassification. The deep learning can be implemented by one or moreneural networks (e.g., Residual Neural Network(s) (ResNet(s)), and/orConvolutional Neural Network(s) (CNN(s))). The individual neuralnetworks may be comprised of numerous stacked layers of variousmodalities to provide a plurality of layers of convolution. The neuralnetworks are trained to automatically recognize and determine modulationtypes of received wireless communication signals from digitally sampledand processed data. This training can be achieved, for example, using adataset that includes information for signals having SNRs from −20 dB to+30 dB and being modulated in accordance with a plurality of analogand/or digital modulation schemes (e.g., phase shift keying, and/oramplitude shift keying).

The machine-learning based approach of the present solution can beimplemented to provide a cognitive, automated system to optimize signalclassification analyses by modulation choices from data with variousSNRs (e.g., SNRs from −20 dB to +30 dB). Subsystems can include, but arenot limited to, a tuner, a digitizer, a classifier, and/or an optimizer.Fast recognition and labeling of Radio Frequency (RF) signals in thevicinity is a needed function for Signal Intelligence (SIGINT) devices,spectrum interference monitoring, dynamic spectrum access, and/or meshnetworking.

Artificial intelligence (AI) algorithms and/or game theoretic analysismay be used to help solve the problem of signal classification throughsupervised classification. The game theory analysis provides a flexibleframework to model strategies for improved decision-making optimization.Classification strategies may be based on different supervised gradientdescent learning algorithms and/or different neural network structures.Individual trainable networks are the potential decisions of aone-sided, single-player game vs. nature, and the action is to choosethe goodness-of-fit weighting of the composite network for optimaldecision making. A novel, game-theoretic perspective has been derivedfor solving the problem of supervised classification that takes the bestsignal modulation prediction derived from supervised classificationmodels. In this one-player game, the system determines the modulationtype by choosing the best network model from a plurality of networkmodels at a given time. Within this formulation, a reward matrix(weighted or non-weighted) is used for consistent classification factorsthat results in higher accuracy and precision compared to usingindividual machine learning models alone.

The reward matrix comprises an MxC matrix, where M is the number ofmachine learned models and C is the number of modulation classes. Thereward matrix uses goodness-of-fit-predicted class scores or responsesin the form of a matrix based on the number of signals and modulationclasses. These goodness-of-fit-predicted class scores are used in alinear program to optimally choose which machine learned model to useper signal. For example, a machine learned model can be selected inaccordance with the following mathematical equation:

maximize f(x) subject to

Ax≤b

x≥0

where x represents a decision variable, A represents coefficients in areward matrix, b represents coefficients which satisfy constraints, andf represents a linear objective function of constants.

FIG. 1 presents an overview of the signal classification system. Thesignal classification system is generally configured to generate machinelearned models including sets of signal features/characteristics thatcan be used to recognize and classify signals and/or sources of signals.These sets of signal features/characteristics are then stored in adatastore(s) and/or used by communication devices (e.g., cognitiveradios) to determine, for example, whether wireless channels areavailable or unavailable.

The communication devices can include, but are not limited to, cognitiveradios configured to recognize and classify radio signals by modulationtype at various Signal-to-Noise Ratios (SNRs). Each of the cognitivedevices comprises a cognitive sensor employing machine learningalgorithms. In some scenarios, the machine learned algorithms includeneural networks which are trained and tested using an extensiverepresentative dataset consisting of 24 or more digital and analogmodulations. The neural networks learn from the time domain amplitudeand phase information of the modulation schemes present in the trainingdataset. The machine learning algorithms facilitate making preliminaryestimations of modulation types and/or signal sources based on machinelearned signal feature/characteristic sets. Linear programmingoptimization may be used to determine the best modulation classificationbased on prediction scores output from one or more machine learningalgorithms.

A communication device can significantly reduce the potentially massivememory storage requirements needed for training data by usingcompressive sensing techniques, such as but not limited to the DiscreteWavelet Transform (DWT). Data compression techniques such as the DWTtransform signals into sparse coefficient sets, and many of thecoefficients may be discarded without negatively affecting performanceof the communication device. Through this discarding of coefficients,the storage requirements become significantly less than what would havebeen required for the original signal data.

Referring now to FIG. 2, there is provided an illustration of anillustrative communications system 200. Communications system 200 isgenerally configured to allow communications amongst communicationdevices 202, 204, 208 over wireless channels 206, 210 in a waveformspectrum. The communication devices can include, but are not limited to,cognitive radios. Each cognitive radio is configured to dynamicallyshare the wireless channels 206, 210 to avoid user interference andcongestion. The manner in which the communication devices performdynamic spectrum sharing and/or dynamically transition between wirelesschannels will be described below in relation to FIG. 3.

A user 220 of communication device 202 is a primary user of wirelesschannel 206. As such, the user 220 has first rights to communicateinformation over wireless channel 206 via communication device 202 agiven amount of time (e.g., X microseconds, where X is an integer). User220 licensed use of the wireless channel 206 to another user 222. User222 constitutes a secondary user. Accordingly, user 222 is able to usethe wireless channel 206 to communicate information to/fromcommunication device 204 during the time in which the wireless channelis not being used by the primary user 220 for wireless communications.Detection of the primary user by the secondary user is critical to thecognitive radio environment. The present solution provides a novelsolution for making such detections by secondary users in a shorteramount of time as compared to conventional solutions. The novel solutionwill become evident as the discussion progresses.

During operations, the communication device 204 monitors communicationson wireless channel 206 to sense spectrum availability, i.e., determinean availability of the wireless channel. The wireless channel 206 isavailable when the primary user 220 is not and has not transmitted asignal thereover for a given amount of time. The wireless channel 206 isunavailable when the primary user 220 is transmitting a signal thereoveror has transmitted a signal thereover within a given amount of time.When a determination is made that the wireless channel 206 isunavailable, the communication device 204 performs operations totransition to another wireless channel 210. This channel transition maybe achieved by changing an operational mode of the communication device204 and/or by changing channel parameter(s) of the communication device204. The communication device 204 may transition back to wirelesschannel 206 when a determination is made that the primary user 220 is nolonger using the same for communications.

Referring now to FIG. 3, there is provided a flow diagram of anillustrative method 300 for operating a system (e.g., system 200 of FIG.2). Method 300 begins with 302 and continues with 304 where acommunication device (e.g., communication device 202 of FIG. 2) of asecondary user (e.g., user 222 of FIG. 2) monitors at least one firstwireless channel (e.g., wireless channel 206 of FIG. 2) foravailability. This monitoring involves: receiving signals communicatedover the first wireless channel(s); and processing the signals todetermine whether a primary user (e.g., user 220 of FIG. 2) is using thefirst wireless channel(s) for communications. If so [306:YES], then thewireless channel(s) is(are) considered unavailable. Accordingly, thecommunication device continues monitoring the first wireless channel(s).If not [306:N0], then the wireless channel(s) is(are) consideredavailable. As such, the communication device may use the first wirelesschannel(s) for communicating signals as shown by 308.

As shown by 310, the communication device continues to monitor the firstwireless channel(s). The communication device continues to use thewireless channel(s) for a given period of time or until the primary useronce again starts using the same for communications, as shown by312-314. When the communication device detects that the primary user isonce again using the wireless channel(s) [312:YES], then thecommunication device stops transmitting signals on the first wirelesschannel(s) as shown by 316. Subsequently, 318 is performed where method300 ends or other operations are performed (e.g., return to 304).

A detailed block diagram of an illustrative architecture for acommunication device is provided in FIG. 4. The communication devices202, 204 and/or 206 of FIG. 2 may be the same as or substantiallysimilar to communication device 400 of FIG. 4. As such, the discussionof communication device 400 is sufficient for understandingcommunication devices 202, 204, 206 of FIG. 2.

Communication device 400 implements a machine learning algorithm tofacilitate determinations as to an available/unavailable state ofwireless channel(s) (e.g., wireless channel 206 of FIG. 2). Thecommunication device 400 dynamically transitions communicationoperations between wireless channels based on the determinedavailable/unavailable state(s) thereof. In this regard, thecommunication device 400 includes a plurality of components shown inFIG. 4. The communication device 400 may include more or less componentsthan those shown in FIG. 4. However, the components shown are sufficientto disclose an illustrative solution implementing the present solution.The hardware architecture of FIG. 4 represents one implementation of arepresentative communication device configured to enable dynamic use ofwireless channels to avoid user interference and congestion. As such,the communication device 400 of FIG. 4 implements at least a portion ofthe method(s) described herein.

The communication device 400 can be implemented as hardware, softwareand/or a combination of hardware and software. The hardware includes,but is not limited to, one or more electronic circuits. The electroniccircuits can include, but are not limited to, passive components (e.g.,resistors and capacitors) and/or active components (e.g., amplifiersand/or microprocessors). The passive and/or active components can beadapted to, arranged to and/or programmed to perform one or more of themethodologies, procedures, or functions described herein.

As shown in FIG. 4, the communication device 400 comprises a cognitivesensor 402, a wireless communications circuit 404, a processor 406, aninterface 408, a system bus 410, a memory 412 connected to andaccessible by other portions of communication device 400 through systembus 410, and hardware entities 414 connected to system bus 410. Theinterface 408 provides a means for electrically connecting thecommunication device 400 to other external circuits (e.g., a chargingdock or device).

The cognitive sensor 402 is generally configured to determine a sourceof a signal transmitted over a wireless channel. This determination ismade via a signal source classification application 422 usinginformation 424. Information 424 comprises outputs generated by one ormore machine learning algorithms. The machine learning algorithm(s) canemploy supervised machine learning. Supervised machine learningalgorithms are well known in the art. In some scenarios, the machinelearning algorithm(s) include(s), but is(are) not limited to, a deeplearning algorithm (e.g., a Residual neural network (ResNet), aConvolutional Neural Network (CNN), and/or a Recurrent Neural Network(RNN) (e.g., a Long Short-Term Memory (LSTM) neural network)). Themachine learning process implemented by the present solution can bebuilt using Commercial-Off-The-Shelf (COTS) tools and/or a commerciallyavailable Field Programmable Gate Array (FPGA) (e.g., Xilinx Vertex 7FPGA).

Each machine learning algorithm is provided one or more feature inputsfor a received signal, and makes a decision as to a modulationclassification for the received signal. In some scenarios, the machinelearning algorithms include neural networks that produce outputs hi inaccordance with the following mathematical equations.

h _(i) =L(w _(i)(x _(i)))   (1)

h _(i) =L(w ₂(x ₂)+w ₂(x ₂) + . . . +w _(i)(x _(i)))   (2)

where L( ) represents a likelihood ratio function, w₁, w₁, . . ., w_(i)each represent a weight, and x₁, x₁, . . ., x_(i) represent signalfeatures and/or the raw data. The signal features can include, but arenot limited to, a center frequency, a change in frequency over time, aphase, a change in phase over time, amplitude, an average amplitude overtime, a data rate, and a wavelength. The output h_(i) includes a set ofconfidence scores. Each confidence score indicates a likelihood that asignal was modulated using a respective type of modulation. The set ofconfidence scores are stored in any format selected in accordance with agiven application.

For example, as shown in FIG. 5, the 24 confidence scores (e.g., S₁₋₁,S₁₋₂, . . . , S₁₋₂₄, S₂₋₁, S₂₋₂, . . . , S₂₋₂₄, . . . , S_(N-1),S_(N-2), . . . , S_(N-24)) are stored in a table format so as to beassociated with identifiers for machine learning algorithms (e.g., A1identifying a first neural network, A2 identifying a second neuralnetwork, . . ., A1 identifying an N^(th) neural network) and identifiersfor modulation classes (e.g., M₁ identifying a first modulation class,M₂ identifying a second modulation class, . . ., M₂₄ identifying atwenty-fourth modulation class). The modulation classes can include, butare not limited to, On-Off Keying (OOF), 4 Amplitude Shift Keying (ASK),Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK),8 Phase Shift Keying (PSK), 16 Quadrature Amplitude Modulation (QAM),OQPSK, 16 PSK, 32 PSK, 16 Amplitude and Phase Shift Keying (APSK), 32APSK, 64 APSK, 128 APSK, 16 QAM, 32 QAM, 64 QAM, 128 QAM, 256 QAM,Amplitude Modulation—Single Sideband—With Carrier (AM-SSB-WC), AmplitudeModulation—Single Sideband—Suppressed Carrier (AM-SSB-SC), AmplitudeModulation—Double Sideband—With Carrier (AM-DSB-WC), AmplitudeModulation—Double Sideband—Suppressed Carrier (AM-DSB-SC), FrequencyModulation (FM), and/or Gaussian Minimum Shift Keying (GMSK). Eachconfidence score can include, but is not limited to, a likelihood scoreand/or a goodness-of-fit-predicted score. The goodness-of-fit-predictedscore may be calculated based on the number of signals (e.g., 2.5million) and the number of modulation classes (e.g., 24). Thegoodness-of-fit-predicted score describes how well the machine learningalgorithm and modulation class fit a set of signal observations. Ameasure of goodness-of-fit summarizes the discrepancy between observedvalues and the values expected under the machine learning algorithm inquestion. The goodness-of-fit-predicted score can be determined, forexample, using a chi-squared distribution algorithm and/or a likelihoodratio algorithm. The present solution is not limited to the particularsof this example.

The cognitive sensor 402 then performs operations to either (i) selectthe modulation class associated with the highest confidence score or(ii) select one of the modulation classes for the signal based onresults of an optimization algorithm. The optimization algorithm caninclude, but is not limited to, a game theory based optimizationalgorithm. The game theory based optimization algorithm will bediscussed in detail below.

Once the modulation class has been decided for the received signal, thecognitive sensor 402 then makes a decision as to whether the source ofthe signal was a primary user of the wireless spectrum. This decision ismade based on the modulation class, a bit rate and/or a center frequencyof the signal. For example, a decision is made that the primary user isthe source of a signal when the signal comprises a 10 MHZ-wide BPSKsignal with a center frequency of 2.4 GHz. The present solution is notlimited in this regard.

At least some of the hardware entities 414 perform actions involvingaccess to and use of memory 412, which can be a Random Access Memory(RAM), and/or a disk driver. Hardware entities 414 can include a diskdrive unit 416 comprising a computer-readable storage medium 418 onwhich is stored one or more sets of instructions 420 (e.g., softwarecode) configured to implement one or more of the methodologies,procedures, or functions described herein. The instructions 420 can alsoreside, completely or at least partially, within the memory 412, withthe cognitive sensor 420, and/or within the processor 406 duringexecution thereof by the communication device 400. The memory 412,cognitive sensor 420 and/or the processor 406 also can constitutemachine-readable media. The term “machine-readable media”, as used here,refers to a single medium or multiple media (e.g., a centralized ordistributed database, and/or associated caches and servers) that storethe one or more sets of instructions 420. The term “machine-readablemedia”, as used here, also refers to any medium that is capable ofstoring, encoding or carrying a set of instructions 420 for execution bythe processor 406 and that cause the processor 406 to perform any one ormore of the methodologies of the present disclosure.

Referring now to FIG. 6, there is provided a more detailed diagram ofthe cognitive sensor 402. As shown in FIG. 6, cognitive sensor 402 iscomprised of an antenna 602, a bandwidth filter 604, a down converter606, an Analog-to-Digital Converter (ADC) 608, a machine learningalgorithm selector 610, and a signal classifier 612. Antenna 602 isconfigured to receive a radio signaly(t) transmitted from communicationdevices (e.g., communication device 202, 204 and/or 206 of FIG. 1). Anillustrative radio signal 700 is shown in FIG. 7. The received radiosignaly(t) is filtered on a bandwidth B_(L) by bandwidth filter 604, andthen down converted by down converter 606. The down converted signalx(t) is passed to the input of the ADC 608. ADC 608 is configured toconvert analog voltage values to digital values, and communicate thedigital values x(n) to the signal classifier 610.

The signal classifier 612 uses one or more machine learning algorithmsto (i) detect the radio signaly(t) in the presence of noise and (ii)make a decision 614 as to the modulation classification that should beassigned thereto. For example, as shown in FIG. 7, a trained CNN/neuralnetwork is provided a Fast Fourier Transform input signal 702, processesthe input signal, and outputs prediction scores 704 for a plurality ofmodulation classes. The signal is assigned a QPSK modulation class sinceit is associated with the highest predictions score 706. The presentsolution is not limited to the particulars of this example. In otherscenarios, one of the multiple specific learning algorithms used totrain the neural network may be selected, or the ensemble of all of thetechniques may be combined in an optimal way. The learning algorithmscan include, but are not limited to, Adam, Stochastic Gradient DecentMethod, and/or RMSprop; if all techniques available are employed, theoutputs from the ensemble of networks trained by multiple techniques maybe combined optimally by game theoretic techniques. It should be notedthat the modulation class that is selected in accordance with theoptimization algorithm may or may not be associated with the highestprediction/likelihood score.

Once the modulation classification has been decided for the signal, thesignal classifier 612 performs further operations to determine whetherthe primary user is the source of the signal. These operations caninvolve: obtaining the modulation class assigned to the signal;obtaining a bit rate and center frequency for the radio signal; andcomparing the modulation class, bit rate and center frequency topre-stored source information to determine if a match existstherebetween by a certain amount (e.g., the bit rates match by at least70% and/or the center frequencies match by at least 50%). If a matchexists, then the signal classifier 612 decides that the primary user isthe source of the radio signal and is using the band B_(L). Otherwise,the signal classifier 612 decides that someone other than the primaryuser is the source of the radio signal and trying to encroach on theband B_(L). If the radio signal y(t) is detected and the primary user isusing the band B_(L), then a decision is made that the band B_(L) isunavailable. Otherwise, a decision is made that the band B_(L) isavailable.

An illustrative architecture for a neural network implementing thepresent solution is provided in FIG. 8. As shown in FIG. 8, the neuralnetwork comprises a signal source classifier that performs one or moremachine learning algorithms. Each machine learning algorithm uses aninput x_(i) and generates an output h_(i). The input x_(i) may beprovided in a time domain (e.g., defines a waveform shape), a frequencydomain, a phase domain and/or an amplitude domain. The output h_(i)comprises a set of prediction/likelihood scores determined for aplurality of modulation classes. In some scenarios, the output h_(i) isdetermined in accordance with the above provided mathematical equation(1) or (2).

Another illustrative architecture for a neural network implementing thepresent solution is provided in FIG. 9. As shown in FIG. 9, the neuralnetwork comprises a signal source classifier that performs one or moremachine learning algorithms. The signal source classifier receives aplurality of inputs x_(i-d1), x_(i-d2), . . . , x_(i-dV) and generatesan output h_(i). The inputs may be provided in different domains. Forexample, input x_(i-d1) is provided in a frequency domain (e.g.,defining a change in frequency over time). Input x_(i-d2) is provided ina phase domain (e.g., defining a change in phase over time), while inputx_(i-dV) is provided in an amplitude domain (e.g., defining an averageamplitude over time) or other domain (e.g., a time domain). The inputsx_(i-d2), . . . , x_(i-dV) can be derived using various algorithms thatinclude, but are not limited to, a Fourier transform algorithm, a powerspectral density algorithm, a wavelet transform algorithm, and/or aspectrogram algorithm. Each machine learning algorithm uses acombination of the inputs to determine a set of prediction/likelihoodscores. The inputs x_(i-d1), x_(i-d2), . . . , X_(i-dV) may be weighteddifferently by the machine learning algorithms. The weights can bepre-defined, or dynamically determined based on characteristic(s) of thereceived waveform. The prediction/likelihood scores are then analyzed todetermine a modulation class to be assigned to the radio signal. Forexample, the modulation class is assigned to the radio signal which isassociated with the highest prediction/likelihood score or which isassociated with a prediction/likelihood score selected in accordancewith an optimization algorithm (e.g., a game theory algorithm).

The present solution is not limited to the neural network architecturesshown in FIGS. 8-9. For example, the neural network can include aplurality of residual units that perform the machine learning algorithmin a sequential manner as shown in FIG. 10.

As noted above, the modulation class may be selected based on results ofa game theory analysis of the machine learned models. The followingdiscussion explains an illustrative game theory optimization algorithm.

Typical optimization of a reward matrix in a one-sided, “game againstnature” with a goal of determining the highest minimum gain is performedusing linear programming techniques. In most cases, an optimal result isobtained, but occasionally one or more constraints eliminate possiblefeasible solutions. In this case, a more brute-force subset summingapproach can be used. Subset summing computes the optimal solution bydetermining the highest gain decision after iteratively considering allsubsets of the possible decision alternatives.

A game theory analysis can be understood by considering an exemplarytactical game. Values for the tactical game are presented in thefollowing TABLE 1. The unitless values range from −5 to 5, whichindicate the reward received performing a given action for a particularscenario. The actions for the player correlate in the rows in TABLE 1,while the potential scenarios correlate to the columns in TABLE 1. Forexample, the action of firing a mortar at an enemy truck yields apositive reward of 4, but firing a mortar on a civilian truck yields anegative reward of −4, i.e., a loss. The solution can be calculated froma linear program, with the results indicating that the best choice forthe play is to advance rather than fire mortar or do nothing. Inexamples with very large reward matrices, the enhancement technique ofsubset summing may also be applied. Since there are four scenarios inthis example (enemy truck, civilian truck, enemy tank, or friendlytank), there are 2⁴=16 subsets of the four scenarios. One of thesesubsets considers none of the scenarios, which is impractical. So inpractice, there are always 2^(P)−1 subsets, where P is the number ofcolumns (available scenarios) in a reward matrix. TABLE 1 is reproducedfrom the following document: Jordan, J. D. (2007). Updating OptimalDecisions Using Game Theory and Exploring Risk Behavior Through ResponseSurface Methodology.

TABLE 1 Enemy Civilian Enemy Friendly Truck Truck Tank Tank Fire Mortar4 −4  5 −5  Advance 1 4 0 4 Do Nothing −1  1 −2  1

The goal of linear programming is to maximize a function over a setconstrained by linear inequalities and the following mathematicalequations (3)-(9).

max z=v+0w ₁+0w ₂+0w ₃   (3)

s.t. v≤4w ₁+1w ₂+−1w ₃   (4)

v≤−4w ₁+4w ₂+1w ₃   (5)

v≤5w ₁+0w ₂+−2w ₃   (6)

v≤−5w ₁+4w ₂+1w ₃   (7)

Σw _(i)=1   (8)

w _(i)≥0 ∀i   (9)

where z represents the value of the game or the objective function, vrepresents the value of the constraints, w₁ represents the optimalprobability solution for the choice ‘Fire Mortar’, w₂ represents theoptimal probability solution for the choice ‘Advance’, w₃ represents theoptimal probability solution for the choice ‘Do Nothing’, and irepresents the index of decision choice.

Using a simplex algorithm to solve the linear program yields mixedstrategy {0.2857, 0.7143, 0}. To maximize minimum gain, the playershould fire a mortar approximately 29% of the time, advance 71% of thetime, and do nothing none of the time.

In scenarios with very large reward matrices, the optional technique ofsubset summing may be applied. The subset summing algorithm reduces aconstrained optimization problem to solving a series of simpler,reduced-dimension constrained optimization problems. Specifically, for areward matrix consisting of P scenarios (columns), a set of 2^(P)−1 newreward matrices are created by incorporating unique subsets of thescenarios. To illustrate the generation of the subsets to be considered,the following mathematical equation (10) shows an example of constraintsfrom the example of TABLE 1 where each row in the equation correspondsto a row in the reward matrix A. Each new reduced reward matrix isformed by multiplying A element-wise by a binary matrix. Each of the2^(P)−1 binary matrices has a unique set of columns which are all-zero.The element-wise multiplication serves to mask out specific scenarios,leaving only specific combinations, or subsets, of the originalscenarios to be considered. This operation increases the run time, butmay be a necessary trade-off for improved accuracy. This method alsoensures that the correct answer is found by computing the properobjective function. If, for example, A represents a reward matrix, thenthe solution for computing all combinations of rows is:

$\begin{matrix}\begin{matrix}{{A.}*} & \left\lbrack 1 \right. & 1 & 0 & 1 \\ & 1 & 1 & 0 & 1 \\ & 1 & 1 & 0 & \left. 1 \right\rbrack\end{matrix} & (10)\end{matrix}$

One reason for running all combinations of decisions, 2^(P)−1, where Pis the number of columns in a reward matrix, is that one or moreconstraints eliminate(s) possible feasible solutions, as shown in FIG.12 with circles. A feasible region is a graphical solution space for theset of all possible points of an optimization problem that satisfy theproblem's constraints. Information is treated as parameters rather thanconstraints, so that a decision can be made outside of traditionalfeasible regions. This is why the present solution works robustly withcomplex data for general decision-making applications. Note that FIG. 12is a simplified representation that could have as many as P dimensions.

The above TABLE 1 can be modified in accordance with the presentsolution. For example, as shown in FIG. 11, each row of a table 1100 isassociated with a respective machine learning algorithm of a pluralityof machine learning algorithms, and each column is associated with arespective modulation class of a plurality of modulation classes. Eachcell in the body of the table 1100 includes a likelihood score S. Thelikelihood scores can include, but are not limited to,goodness-of-fit-predicted scores calculated based on the number ofsignals and modulation classes. Each goodness-of-fit-predicted scoredescribes how well the machine learned model and modulation class fit aset of observations. A measure of goodness-of-fit summarizes thediscrepancy between observed values and the values expected under themachine learned model in question. The goodness-of-fit-predicted scorecan be determined, for example, using a chi-squared distributionalgorithm and/or a likelihood ratio algorithm. The modulation classescan include, but are not limited to, frequency modulation, amplitudemodulation, phase modulation, angle modulation, and/or line codingmodulation.

The reward matrix illustrated by table 1100 can be constructed andsolved using a linear program. For example, an interior-point algorithmcan be employed. A primal standard form can be used to calculate optimaltasks and characteristics in accordance with the following mathematicalequation (11).

maximize f(x) s.t.

A(x)≤b

x≥0

Referring now to FIG. 13, there is provided a flow diagram of anillustrative method 1300 for operating a communication device (e.g.,communication device 202, 204 or 206 of FIG. 2). Method 1300 begins with1302 and continues with 1304 where the communication device receives asignal (e.g., signal 700 of FIG. 7). In 1306, the communication deviceperforms one or more machine learning algorithms (e.g., neuralnetwork(s)) using at least one feature of the signal (e.g., a frequency,phase, amplitude) as an input to generate a plurality of scores (e.g.,goodness-of-fit-predicted scores). Each score represents a likelihoodthat the signal was modulated using a given modulation type of aplurality of different modulation types (e.g., ASK, PSK, QAM, and/orFM). A modulation class is assigned to the signal in 1308 based on thescores. For example, the signal is assigned a modulation class that isassociated with the score having the greatest value. Alternatively, thesignal is assigned a modulation class that is associated with a scorethat was selected based on results of an optimization algorithm (e.g., agame theory analysis).

Next in 1310, a determination is made by the communications device as towhether a given wireless channel (e.g., wireless channel 206 or 210 ofFIG. 2) is available based on the modulation class assigned to thesignal, a bit rate, and/or a center frequency of the signal. In somescenarios, a determination is made that the given wireless channel isunavailable when a decision is made that the primary user is not thesource of the signal (e.g., based on the modulation class, bit rate ofthe signal and/or center frequency of the signal). A determination ismade that the given wireless channel is unavailable when a decision ismade that the primary user is the source of the signal (e.g., based onthe modulation class, bit rate of the signal and/or center frequency ofthe signal).

The communication device performs operations in 1312 to selectively usethe given wireless channel for communicating signals based on results ofthe determination made in 1310. For example, the given wireless channelis used by a secondary user (e.g., user 222 of FIG. 2) forcommunications when a decision is made that the same is available (e.g.,when the primary user (e.g., user 220 of FIG. 2) is not the source ofthe signal thereby indicating that the primary user is not using thesame). In contrast, the secondary user stops using the given wirelesschannel for communications when a decision is made that the same isunavailable (e.g., when the primary user is the source of the signalthereby indicating that the primary user is using the same).Subsequently, 1314 is performed where method 1300 ends or otheroperations are performed (e.g., return to 1304).

Although the present solution has been illustrated and described withrespect to one or more implementations, equivalent alterations andmodifications will occur to others skilled in the art upon the readingand understanding of this specification and the annexed drawings. Inaddition, while a particular feature of the present solution may havebeen disclosed with respect to only one of several implementations, suchfeature may be combined with one or more other features of the otherimplementations as may be desired and advantageous for any given orparticular application. Thus, the breadth and scope of the presentsolution should not be limited by any of the above describedembodiments. Rather, the scope of the present solution should be definedin accordance with the following claims and their equivalents.

What is claimed is:
 1. A method for operating a communication device,comprising: receiving a signal at the communication device; performing,by the communication device, one or more machine learning algorithmsusing at least one feature of the signal as an input to generate aplurality of scores, each said score representing a likelihood that thesignal was modulated using a given modulation type of a plurality ofdifferent modulation types; assigning a modulation class to the signalbased on the plurality of scores; determining whether a given wirelesschannel is available based at least on the modulation class assigned tothe signal; and selectively using the given wireless channel forcommunicating signals based on results of said determining.
 2. Themethod according to claim 1, wherein the communication device comprisesa cognitive radio.
 3. The method according to claim 1, furthercomprising selecting a score from the plurality of scores which has ahighest value.
 4. The method according to claim 3, wherein themodulation class is associated with the selected score.
 5. The methodaccording to claim 1, further comprising selecting a score from theplurality of scores based on results of a game theory analysis.
 6. Themethod according to claim 5, wherein the modulation class is associatedwith the selected score.
 7. The method according to claim 1, furthercomprising deciding whether a source of the signal is a primary user ofthe given wireless channel based at least on the modulation classassigned to the signal.
 8. The method according to claim 7, wherein adetermination is made that the given wireless channel is unavailablewhen a decision is made that the primary user is the source of thesignal.
 9. The method according to claim 7, wherein the deciding isfurther based on a bit rate and a center frequency of the signal. 10.The method according to claim 1, wherein each of the plurality of scorescomprises a goodness-of-fit-predicted score.
 11. A communication device,comprising: a processor; and a non-transitory computer-readable storagemedium comprising programming instructions that are configured to causethe processor to implement a method for performing communicationoperations, wherein the programming instructions comprise instructionsto: receive a signal; effectively store training data for one or moremachine learning algorithms, using compressive sensing techniques;perform one or more machine learning algorithms using at least onefeature of the signal as an input to generate a plurality of scores,each said score representing a likelihood that the signal was modulatedusing a given modulation type of a plurality of different modulationtypes; assign a modulation class to the signal based on the plurality ofscores; determine whether a given wireless channel is available based atleast on the modulation class assigned to the signal; and selectivelyuse the given wireless channel for communicating signals based onresults of said determining.
 12. The communication device according toclaim 11, wherein the communication device comprises a cognitive radio.13. The communication device according to claim 11, wherein theprogramming instructions further comprise instructions to select a scorefrom the plurality of scores which has a highest value.
 14. Thecommunication device according to claim 13, wherein the modulation classis associated with the selected score.
 15. The communication deviceaccording to claim 11, wherein the programming instructions furthercomprise instructions to select a score from the plurality of scoresbased on results of a game theory analysis.
 16. The communication deviceaccording to claim 15, wherein the modulation class is associated withthe selected score.
 17. The communication device according to claim 11,wherein the programming instructions further comprise instructions toselect decide whether a source of the signal is a primary user of thegiven wireless channel based at least on the modulation class assignedto the signal.
 18. The communication device according to claim 17,wherein a determination is made that the given wireless channel isunavailable when a decision is made that the primary user is the sourceof the signal.
 19. The communication device according to claim 17,wherein the decision as to whether the source of the signal is theprimary user is further based on a bit rate and a center frequency ofthe signal.
 20. The communication device according to claim 11, whereineach of the plurality of scores comprises a goodness-of-fit-predictedscore.
 21. The communication device according to claim 11, whereincompressive sensing techniques are employed to reduce memory storagerequirements for the training data used by one or more machine learningalgorithms.